On Certain Pieris Caterpillars
نویسندگان
چکیده
منابع مشابه
Extremal algebraic connectivities of certain caterpillar classes and symmetric caterpillars
A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and n ≥ 6 be given. Let Pd−1 be the path of d − 1 vertices and Sp be the star of p + 1 vertices. Let p = [p1, p2, ..., pd−1] such that p1 ≥ 1, p2 ≥ 1, ..., pd−1 ≥ 1. Let C (p) be the caterpillar obtained from the stars Sp1 , Sp2 , ..., Spd−1 and the path Pd−1 by identifying the root of Spi with the i...
متن کاملUniversal caterpillars
For a class V of graphs, denote by a(@?) the least value of m so that for some graph II on m vertices, every GE Q occurs as a subgraph of U. In this note we obtain rather sharp bounds on u(q) when Q is the class of caterpillars on n vertices, i.e., tree with property that the vertices of degree exceeding one induce a path. Recently several of the authors have investigated graphs U(g) which are ...
متن کاملEla Extremal Algebraic Connectivities of Certain Caterpillar Classes and Symmetric Caterpillars∗
A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and n ≥ 6 be given. Let Pd−1 be the path of d − 1 vertices and Sp be the star of p + 1 vertices. Let p = [p1, p2, ..., pd−1] such that p1 ≥ 1, p2 ≥ 1, ..., pd−1 ≥ 1. Let C (p) be the caterpillar obtained from the stars Sp1 , Sp2 , ..., Spd−1 and the path Pd−1 by identifying the root of Spi with the i...
متن کاملJapanese pieris toxicosis of goats.
and laboratory findings in small companion animals with lead 6. Watson ADY: 1981, Lead poisoning in a cat. J Small Anim poisoning: 347 cases (1977-1986). Am Vet Med Assoc 199:93Pract 22:85-89. 97. 7. Zook BC, McCowell BS, Gilmore CE: 1970, Basophilic stippling 5. Scott HM: 1963, Lead poisoning in small animals. Vet Rec 75: of erythrocytes in dogs with special reference to lead poisoning. 830-83...
متن کاملThe Loebl-Komlós-Sós Conjecture for Trees of Diameter 5 and for Certain Caterpillars
Loebl, Komlós, and Sós conjectured that if at least half the vertices of a graph G have degree at least some k ∈ N, then every tree with at most k edges is a subgraph of G. We prove the conjecture for all trees of diameter at most 5 and for a class of caterpillars. Our result implies a bound on the Ramsey number r(T, T ) of trees T, T ′ from the above classes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Psyche: A Journal of Entomology
سال: 1909
ISSN: 0033-2615,1687-7438
DOI: 10.1155/1909/490690